901. Lawler E. L. and Wood D. E. (1966) Branch-and-bound methods: A survey. Operations Research,14(4), p. 699-719.

902. Lazanas A. and Latombe J.-C. (1992) Landmark-based robot navigation. In Proceedings of the TenthNational Conference on Artificial Intelligence (AAAI-92), p. 816—822, San Jose. AAA! Press.

903. Le Cun Y., Jackel L., Boser В., and Denker J. (1989) Handwritten digit recognition: Applications ofneural network chips and automatic learning. IEEE Communications Magazine, 27(11), p. 41-46.

904.  LeCun Y., Jackel L., Bottou L., Brunot A., Cortes C, Denker J., Drucker H., Guyon I., Muller U.,Sackinger E., Simard P., and Vapnik V. N. (1995) Comparison of learning algorithms for handwritten digit recognition. In Fogelman F. and Gallinari P. (Eds.), International Conference on Artificial Neural Networks, p. 53-60, Berlin. Springer-Verlag.

905. Leech G., Rayson P., and Wilson A. (2001) Word Frequencies in Written and Spoken English: Based onthe British National Corpus. Longman, New York.

906. Lefkovitz D. (1960) A strategic pattern recognition program for the game Go. Technical note 60-243,Wright Air Development Division, University of Pennsylvania, Moore School of Electrical Engineering.

907. Lenat D. B. (1983) EURISKO: A program that learns new heuristics and domain concepts: The natureof heuristics, III: Program design and results. Artificial Intelligence, 21(1-2), p. 61-98.

908. Lenat D. В. (1995) Cyc: A large-scale investment in knowledge infrastructure. Communications of theACM, 38(11).

909. Lenat D. B. and Brown J. S. (1984) Why AM and EURISKO appear to work. Artificial Intelligence,23(3), p. 269-294.

910. Lenat D. B. and Guha R. V. (1990) Building Large Knowledge-Based Systems: Representation andInference in the CYC Project. Addison-Wesley, Reading, Massachusetts.

911. Leonard H. S. and Goodman N. (1940) The calculus of individuals and its uses. Journal of SymbolicLogic, 5(2), p. 45-55.

912. Leonard J. J. and Durrant-Whyte H. (1992) Directed sonar sensing for mobile robot navigation. Kluwer,Dordrecht, Netherlands.

913. Lesniewski S. (1916) Podstawy ogolnej teorii mnogosci. Moscow.

914. Lettvin J. Y., Maturana H. R., McCulloch W. S., and Pitts W. H. (1959) What the frog's eye tells thefrog's brain. Proceedings of the IRE, 47(11), p. 1940-1951.

915. Letz R., Schumann J., Bayerl S., and Bibel W. (1992) SETHEO: A high-performance theorem prover.Journal of Automated Reasoning, 8(2), p. 183-212.

916. Levesque H. J. and Brachman R. J. (1987) Expressiveness and tractability in knowledge representationand reasoning. Computational Intelligence, 3(2), p. 78-93.

917. Levesque H. J., Reiter R., Lesperance Y., Lin F., and Scherl R. (1997a) GOLOG: A logicprogramming language for dynamic domains. Journal of Logic Programming, 31, p. 59-84.

918. Levesque H. J., Reiter R., Lesperance Y., Lin F., and Scherl R. (1997b) GOLOG: A logicprogramming language for dynamic domains. Journal of Logic Programming, 31, p. 59-84.

919. Levitt G. M. (2000) The Turk, Chess Automaton. McFarland and Company.

920. Levy D. N. L. (Ed.) (1988a) Computer Chess Compendium. Springer-Verlag, Berlin.